Shapely monads and analytic functors

نویسندگان

  • Richard Garner
  • Tom Hirschowitz
چکیده

In mathematics and computer science, we often encounter structures which are faithfully encoded by a graphical calculus of the following sort. The basic data of the structure are depicted as certain diagrams; the basic operations of the structure act by glueing together these diagrams along certain parts of their boundaries; and the axioms of the structure are just those necessary to ensure that “every two ways of glueing a compound diagram together agree”. Commonly, such calculi depict structures wherein “functions”, “arrows” or “processes” are wired together along input or output “ports”. For instance, we have multicategories [21], whose arrows have many inputs but only one output; polycategories [29], whose arrows have multiple inputs and outputs, with composition subject to a linear wiring discipline; and coloured properads [31] and props [24], which are like polycategories but allow for non-linear wirings. Mathematical structures such as these are important in algebraic topology and homological algebra—encoding, for example, operations arising on infinite loop spaces [26] or on Hochschild cochains [27]—but also in logic and computer science. For example, polycategories encode the underlying semantics of a linear sequent calculus [22], while props have recently been used as an algebraic foundation for notions of computational network such as signal flow graphs [3] and Bayesian networks [10]. Other kinds of graphical structures arising in computer science include proof nets [11, §2], interaction nets [20] and bigraphs [14]. There is an established approach to describing structures of the above kind using monads on presheaf categories. The presheaf category captures the essential topology of the underlying graphical calculus, while the monad encodes both the wiring operations of the structure and the axioms that they obey; the algebras for the monad are the instances of the structure. One aspect which this approach does not account for is that the axioms should be determined by the requirement that “every two ways of wiring a compound diagram together agree”. The first main contribution of this paper is to rectify this: we explain the observed form of the axioms as a property of the associated monad—which we term shapeliness—stating that “every two operations of the same shape coincide”.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial and Analytic Functors and Monads, revisited

We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.

متن کامل

Monads, shapely functors, and traversals

This paper demonstrates the potential for combining the polytypic and monadic programming styles, by introducing a new kind of combinator, called a traversal. The natural setting for defining traversals is the class of shapely data types. This result reinforces the view that shapely data types form a natural domain for polytypism: they include most of the data types of interest, while to exceed...

متن کامل

Predicate Logic for Functors and Monads

This paper starts from the elementary observation that what is usually called a predicate lifting in coalgebraic modal logic is in fact an endomap of indexed categories. This leads to a systematic review of basic results in predicate logic for functors and monads, involving induction and coinduction principles for functors and compositional modal operators for monads.

متن کامل

Qf Functors and (co)monads

One reason for the universal interest in Frobenius algebras is that their characterisation can be formulated in arbitrary categories: a functor K : A → B between categories is Frobenius if there exists a functor G : B → A which is at the same time a right and left adjoint of K; a monad F on A is a Frobenius monad provided the forgetful functor AF → A is a Frobenius functor, where AF denotes the...

متن کامل

Constructing Applicative Functors

Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads. First used in parser libraries, they are now seeing a wide range of applications. This paper sets out to explore the space of non-monadic applicative functors useful in programming. We work with a generalization, lax monoidal functors, and consider several methods of co...

متن کامل

Polynomial Functors and Trees

We explore the relationship between polynomial functors and trees. In the first part we characterise trees as certain polynomial functors and obtain a completely formal but at the same time conceptual and explicit construction of two categories of rooted trees, whose main properties we describe in terms of some factorisation systems. The second category is the category Ω of Moerdijk and Weiss. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2018